M-Ary phase shift keying (PSK) bit-boundary turbo coded system

ABSTRACT

A turbo coded communication system includes a gray scale mapper in a transmitter for generating a symbol constellation of modulated signals points that can be separated by boundary lines in the constellation space into bitwise groups of zero bits and one bits where the shortest distance from a boundary line to received value in the constellation space indicates the bitwise soft metrics that is computed using a set of bitwise soft metric equations are a function of a minimum angle using closed form algebraic equations in turbo decoding receiver. In the case of phase shift keying (PSK) modulation, the bit boundary lines are predetermined by a minimum angle in the constellation space for a specified M-ary modulation, so that, the soft metric equations are only a function of the received signal value for providing efficient computation of the bitwise soft metric.

STATEMENT OF GOVERNMENT INTEREST

The invention was made with Government support under contract No. F04701-93-C-0094 by the Department of the Air Force. The Government has certain rights in the invention.

REFERENCE TO RELATED APPLICATION

The present application is related to applicant's copending application entitled M-Ary Quadrature Amplitude Modulation (QAM) Bit-Boundary Turbo Coded System Ser. No. 10/462,962, filed Jun. 17, 2003, by the same inventor.

FIELD OF THE INVENTION

The invention relates to the field of turbo coded communication systems. More particularly, the present invention relates to gray code mapping during transmission and bit boundary metric determinations during reception for improved performance in phase shift keying (PSK) modulation and quadrature amplitude modulation (QAM) turbo coded communication systems.

BACKGROUND OF THE INVENTION

Communication system performance is enhanced by both power and bandwidth efficiencies. Since 1993, turbo codes have been shown to be powerful forward error correction codes that enhance communication system performance. Many commercial communication systems use turbo codes as standards through the development of standard turbo codeces. Although a significant amount of coding gain can be achieved, the binary turbo codes do not have good bandwidth efficiency due to low code rates unless heavily punctured with additional coding bits. Heavily punctured turbo coding results in bit-error-rate (BER) performance degradation. Conventional approaches to improving bandwidth efficiencies are to adopt turbo trellis coded modulation (TTCM). For most TTCM structures, each modulated symbol corresponds to a state transition during modulation where a respective metric is computed for each received symbol during reception. A TTCM system can provide good turbo code performance without bandwidth expansion. However, a TTCM system requires a different code structure than a conventional binary turbo code. Each unique turbo code design results in an expensive new codec development.

One way to attain both power and bandwidth efficiencies is to adopt high-order modulation schemes with a binary turbo code. An alternative to a TTCM structure for obtaining both power and bandwidth efficiency is to adopt high-order nonbinary modulation such as M-ary phase shift keying (PSK) modulation or M-ary quadrature amplitude modulation (QAM). High-order nonbinary modulation structures include, for examples, the commonly used 8-ary PSK or 16-ary PSK, with a commonly used binary turbo code, or for examples, the commonly used 16-ary QAM, or 64-ary QAM, with a commonly used binary turbo code. These high-order nonbinary modulation methods require a conversion of demodulator output that is associated with the nonbinary channel symbol into bit metrics as inputs to the binary turbo decoder. The advantage of M-ary nonbinary modulation is that no new codec development is required because the binary turbo codeces are commercially available. However, the problem with M-ary nonbinary modulation is the need to implement improved methods of forming the bitwise decoding metrics on binary bits from the nonbinary demodulator. For most TTCM structures, each modulated symbol has a state with a transition from one state to another state defining a metric distance. The maximum likelihood metric, which is associated with the minimum Euclidean distance, is formed at the demodulator and used for turbo decoding. However, for the binary turbo coding, the bitwise metrics must be formed for turbo decoding.

One way to form the bitwise decoding metrics from a PSK or a QAM demodulator is to use the maximum likelihood metric that is the optimum one for uncoded demodulation as widely used. Unfortunately, forming this metric requires complex circuitry and knowledge of channel condition, which is sometimes unavailable. More importantly, this decoding metric gives inferior bit-error-rate (BER) performance to the TTCM system. A puncturing approach is applied to a trellis coded modulation using a turbo coding, such as a rate (m−1)/m binary convolutional code punctured from an optimum and widely used rate 1/2 convolutional code followed by a 2^(L)-ary PSK or QAM modulation, where L is the number of bits in a symbol. A property of this puncturing approach is that a complicated mapping is used for the signal constellation. Common puncturing converts a commonly used turbo code into a rate turbo code of rate m′/m, where m′<m, for an 2^(L)-ary high order binary modulation. A gray code approach can be used where gray code mapping defines a signal constellation space and can be used during turbo coding that also utilizes puncturing for improved bandwidth efficiency. However, when m′/m is greater than ½, more than 50% of parity check bits need to be discarded, which can cause additional BER degradation. These and other disadvantages are solved or reduced using the invention.

SUMMARY OF THE INVENTION

An object of the invention is to provide a soft metric generator using boundary lines within the symbol constellation space for encoded symbols in a turbo code communication system.

Another object of the invention is to provide a soft metric generator using boundary lines within the symbol constellation space for gray code encoded symbols in a turbo code communication system using quadrature amplitude modulation.

Yet another object of the invention is to provide a soft metric generator using boundary lines within the symbol constellation space for gray code encoded symbols in a turbo code communication system using phase shift keying modulation.

The invention is directed to a turbo code communication system that forms bit boundary turbo decoding metrics for M-ary waveforms. A first aspect of the invention is directed to forming bit boundary turbo decoding metrics for M-ary quadrature amplitude modulation (QAM) waveforms. A second aspect of the invention is directed to forming of bit boundary turbo decoding metrics for M-ary phase shift keying (PSK) waveforms. The bit boundary metrics determinations can be directly implemented without prior knowledge of channel condition. The bit boundary metrics provide improved bit error rate (BER) performance.

In the preferred form, an input data stream is passed through a conventional turbo encoder providing turbo encoded data that is then mapped through a mapper, such as a gray scale mapper, prior to M-ary modulation and communication of channel symbols over an additive white Gaussian noise channel. The received channel symbols are demodulated by an M-ary demodulator into demodulated received quadrature signals that are fed into a soft metric generator generating gray scale bit boundary soft metrics that are then fed into a turbo decoder for generating an estimate of the original bit stream for effective M-ary turbo coding communications.

In a preferred form, a rate 1/2 binary punctured turbo code from the commonly used rate 1/3 turbo code is used. The bandwidth efficiency is achieved by directly cascading a power-efficient rate 1/2 binary turbo code with high-order PSK or QAM modulations. Conventionally, the maximum likelihood metric that is associated with the shortest Euclidean distance, is formed by the soft metric generator and then used for turbo decoding. The bitwise soft metrics are generated for conventional turbo decoding. The use of gray scale encoding in the transmitter enables a computationally efficient soft metrics generator in the receiver using bit boundaries in the signal constellation space. The computation of the soft metrics is reduced to a closed form algebraic computation. Gray scale encoding determines the bit boundaries within the symbol constellation space. The algebraic equations are used to determine shortest distances between the demodulated received signal to the bit boundaries for generating the bitwise soft metrics. The gray scale encoding defines signal symbol points within the symbol constellation space and defines a minimum distance δ for a quadrature amplitude modulation (QAM) turbo communication system in the first aspect of the invention, or provides a minimum angle α for a phase shift keying (PSK) modulation turbo communication system in the second aspect of the invention. The use of gray scale mapping enables the generation of a plurality of bitwise predetermined algebraic equations in the soft metrics generator. In the first aspect of the invention using QAM, the soft metric generator receives the demodulated received signal and computes the bitwise soft metrics using the predetermined minimum distance δ and the predetermined bitwise algebraic equations. In a second aspect of the invention using PSK modulation, the bitwise soft metrics generator receives the demodulated received signal and computes the bitwise soft metrics using the predetermined minimum angle α and predetermined bitwise algebraic equations.

In two preferred forms of the first aspect, 16-ary QAM and 64-ary QAM predetermined distances and the predetermined algebraic equations are specified for direct implementation into the soft metrics generator in a QAM turbo communication system, without loss of generality. In two other preferred forms of the second aspect of the invention, 8-ary PSK and 16-ary PSK predetermined minimum angles and the predetermined algebraic equations are specified for direct implementation into the soft metric generator in a PSK modulation turbo communication system, without loss of generality. The preferred gray scale encoding provides improved BER performance with efficient soft metrics computations. The invention can be applied to various communication systems, including direct broadcasting, personal communications, and satellite communications. These and other advantages will become more apparent from the following detailed description of the preferred embodiment.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a phase shift keying (PSK) modulation or quadrature amplitude modulation (QAM) bit boundary turbo coded communication system.

FIG. 2A depicts 16-ary QAM bit boundary gray scale mapping.

FIG. 2B depicts 64-ary QAM bit boundary gray scale mapping.

FIG. 3A depicts 8-ary PSK bid boundary gray scale mapping.

FIG. 3B depicts 16-ary PSK bid boundary gray scale mapping.

FIG. 4 is a QAM BER performance comparison graph.

FIG. 5 is a PSK BER performance comparison graph.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

An embodiment of the invention is described with reference to the figures using reference designations as shown in the figures. Referring to FIG. 1, an M-ary phase shift keying (PSK) modulation or quadrature amplitude modulated (QAM) gray-scale bit-boundary turbo-coded communication system has improved power and bandwidth efficiency for communicating an input data stream d_(j). The input data stream d_(j) is fed into a conventional binary turbo encoder. The turbo encoder may include two recursive convolutional encoders concatenated in a parallel along with an internal interleaver, all not shown, on the source data bits as a conventional turbo encoder. For example, turbo encoding the original data bits d_(j) is preferably accomplished using a rate 1/3 turbo encoder consisting of two recursive systematic encoders for generating polynomial (23,35)₈ in a parallel concatenated configuration with an S-random interleaver that is used to separate the input bits in the recursive convolutional encoders. A puncturing pattern is used to alternately delete the parity check bits from two recursive systematic encoders to make the turbo code rate 1/2, with an S-random interleaver size of 1024 with S=17, where S is the conventional S-random interleaver parameter.

The turbo encoder provides turbo encoded data U_(j)={a₁, a₂, a₃, a₄, . . . , a_(i)} of a_(i) bits. The encoded data U_(j) is then mapped through a mapper, such as a gray scale mapper, into turbo-coded mapped symbols S_(k) that is fed into an M-ary modulator for generating a channel signal that is communicated over an additive white Gaussian noise channel providing noise components n_(k), where j in the input bit index and k is the symbol index. The received signal r_(k) is demodulated by an M-ary demodulator into I and Q quadrature received signals. The M-ary modulator is an M-ary PSK or QAM modulator, and the M-ary demodulator is an M-ary PSK or QAM demodulator, respectively. The M-ary demodulator demodulates the received signal r_(k) into demodulated quadrature signals, including the demodulated inphase received signal r^((i)) _(k) and the demodulated quadrature received signal r^((q)) _(k) that are both fed into a soft metric generator for generating gray-scale bit-boundary soft bitwise metrics Λ_(j) that are generated for each bit a_(i) of each k symbol such that Λ_(j) is a sequence of bitwise metrics for each k^(th) symbol, that is, Λ_(j)=Λ_(k)(i) for i=1, . . . , L, where L is the order of modulation, such that 2^(L)=M. The bit wise soft metrics Λ_(j) are fed into a turbo decoder that provides an estimate {circumflex over (d)}_(j) of the original data stream d_(j) for power and bandwidth efficient turbo coded communications.

In an 8-ary mapper, every three consecutive coded bits, including systematic and parity-check bits, are denoted as [a₁, a₂, a₃], where the order L equals 3 and bit index i equals, 1, 2 or 3, and are grouped together and gray scale mapped to one of eight symbols within a 8-ary symbol constellation space. Likewise and in a 16-ary mapper, every four consecutive coded bits, including systematic and parity-check bits, are denoted as [a₁, a₂, a₃, a₄], and are grouped together and gray scale mapped to one of 16 symbols within a 16-ary symbol constellation space. Likewise and in a 64-ary mapper, every six consecutive code bits, including systematic and parity-check bits, are denoted as [a₁, a₂, a₃, a₄, a₅, a₆], and are grouped together and gray scale mapped to one of 64 symbols within a 64-ary symbol constellation space. Any M-ary mapper can be used, though in the exemplar forms, 8-ary PSK, 16-ary PSK, 16-ary QAM, and 64-ary QAM gray scale mappers are preferred. A 16-ary gray scale QAM symbol constellation space is shown in FIG. 2A. A 64-ary gray scale QAM symbol constellation space is shown in FIG. 2B. A 8-ary gray scale PSK symbol constellation space is shown in FIG. 3A and a 16-ary gray scale PSK symbol constellation space is shown in FIG. 3B. For channel description, the term [x(j),y(j)] denotes the transmitted I and Q signals associated with each symbol, where j=1, . . . , M for M-ary=-2^(L)-ary, with L equal to 3 for 8-ary signaling, with L equal to 4 for 16-ary signaling, and with L equal to 6 for 64-ary signaling. Without loss of generality, the average transmitted power is set to be unity. With each coded bit having an equal probability 0 or 1, the probability summation of I and Q signal equals to 1 as defined by a probability equation.

${\sum\limits_{j = 1}^{M}{\left\lbrack {{x(j)}^{2} + {y(j)}^{2}} \right\rbrack/M}} = 1$

The channel is modeled as an additive white Gaussian noise channel. On the receiver side, using baseband equivalent representation, the demodulated received I and Q signals at symbol time k can be expressed by I and Q quadrature equations. r ^((i)) _(k) =s ^((i)) _(k) +n ^((i)) _(k) r ^((q)) _(k) =s ^((q)) _(k) +n ^((q)) _(k)

In the quadrature equation, s^((i)) _(k) and s^((q)) _(k) are respectively one of the M x(j) and y(j) values, and n^((i)) _(k) and n^((q)) _(k) are independent zero-mean normally distributed random variables with a variance σ defined by a variance equation.

$\sigma_{n}^{2} = \frac{1}{2 \cdot \left( {E_{s}/N_{0}} \right)}$

In the variance equation, E_(s) is the actual average symbol energy and N₀ is the power density function (PDF) of the white Gaussian noise. The communication channel can be modeled as a Rayleigh fading channel with additive white Gaussian noise. On the receiver side, using baseband equivalent representation, the received I and Q signals at symbol time k can be expressed by I and Q receiver equation. r ^((i)) _(k) =A ^((i)) _(k) ·s ^((i)) _(k) +n ^((i)) _(k) r ^((q)) _(k) =A ^((q)) _(k) ·s ^((q)) _(k) +n ^((q)) _(k)

In the I and Q receiver equations, A^((i)) _(k) and A^((q)) _(k) are Rayleigh distributed with unity power, s^((i)) _(k) and s^((q)) _(k) are respectively one of the M x(j) and y(j) values, and n^((i)) _(k) and n^((q)) _(k) are independent zero-mean normally distributed random variables with variance σ defined by variance equation.

Soft bit metrics are required for turbo decoding. The I and Q demodulated received signals from the PSK or QAM demodulator is fed into the soft metrics generator. There are various computation methods that can be used for forming turbo decoding PSK or QAM soft metrics. A prior art first method of forming a PSK or QAM soft metric out of the PSK or QAM demodulator is through the use of a logarithm likelihood ratio associated with each bit of a channel symbol as described in a logarithm likelihood ratio soft metric equation.

${\Lambda_{k}(n)} = {{Log}\frac{\sum\limits_{{j = 1};{a_{n} = 1}}^{M}{\exp\left\{ {- {\frac{1}{2\sigma_{n}^{2}}\left\lbrack {\left( {r_{k}^{(i)} - {x(j)}} \right)^{2} + \left( {r_{k}^{(q)} - {y(j)}} \right)^{2}} \right\rbrack}} \right\}}}{\sum\limits_{{j = 1};{a_{n} = 0}}^{M}{\exp\left\{ {- {\frac{1}{2\sigma_{n}^{2}}\left\lbrack {\left( {r_{k}^{(i)} - {x(j)}} \right)^{2} + \left( {r_{k}^{(q)} - {y(j)}} \right)^{2}} \right\rbrack}} \right\}}}}$

In the logarithmic likelihood ratio soft metric equation, n=1, . . . , L. The soft metric term Λ_(k)(n) requires the channel side information (CSI) E_(s)/N₀. The channel side information is computationally complex and variable over time.

A prior art second method of forming PSK or QAM soft bit metrics out of a PSK or QAM demodulator is to use the maximization function that replaces the summation in the numerator and denominator in the logarithm likelihood ratio soft metric equation, reflecting a high SNR approximation. Then, the bit soft metric for bit position n, for 1≦n≦L, is described in a modified logarithm likelihood ratio soft metric equation.

$\begin{matrix} {{\Lambda_{k}(n)} = {{Log}\frac{\underset{{j = 1};{a_{n} = 1}}{\overset{M}{MAX}}\left\lbrack {\exp\left\{ {- {\frac{1}{2\sigma_{n}^{2}}\left\lbrack {\left( {r_{k}^{(i)} - {x(j)}} \right)^{2} + \left( {r_{k}^{(q)} - {y(j)}} \right)^{2}} \right\rbrack}} \right\}} \right\rbrack}{\underset{{j = 1};{a_{n} = 0}}{\overset{M}{MAX}}\left\lbrack {\exp\left\{ {- {\frac{1}{2\sigma_{n}^{2}}\left\lbrack {\left( {r_{k}^{(i)} - {x(j)}} \right)^{2} + \left( {r_{k}^{(q)} - {y(j)}} \right)^{2}} \right\rbrack}} \right\}} \right\rbrack}}} \\ {= {{\underset{{j = 1};{a_{n} = 1}}{\overset{M}{MAX}}\left\lbrack {- {\frac{1}{2\sigma_{n}^{2}}\left\lbrack {\left( {r_{k}^{(i)} - {x(j)}} \right)^{2} + \left( {r_{k}^{(q)} - {y(j)}} \right)^{2}} \right\rbrack}} \right\rbrack} -}} \\ {\underset{{j = 1};{a_{n} = 0}}{\overset{M}{MAX}}\left\lbrack {- {\frac{1}{2\sigma_{n}^{2}}\left\lbrack {\left( {r_{k}^{(i)} - {x(j)}} \right)^{2} + \left( {r_{k}^{(q)} - {y(j)}} \right)^{2}} \right\rbrack}} \right\rbrack} \end{matrix}$

This modified logarithm likelihood ratio soft metric equation soft metric also requires computation of the CSI.

A preferred new third method of forming a soft metrics is a bit boundary soft metric computation method. For the case of QAM, the symbol constellation space has points defined by rectangular x-y coordinates that directly translate into the I and Q received signal coordinates. In the signal constellation space defining the signal space for QAM shown in FIG. 2A, for each bit position a₁, a₂, a₃, and a₄, there is a bit₁ boundary, a bit₂ boundary, a bit₃ boundary, and bit₄ boundary. Each bit boundary is a line that separates all pairs of points that have 0 and 1 at a respective bit position. These bit boundaries effectively group half of the points for each bit position a_(i), one group including points with ones in the a_(i) bit position and the other group including points with zeros in the a_(i) bit position. For example, in FIG. 2A, there are eight groupings, with the bit₁ boundary between groups bit₁₋₀ and bit₁₋₁, with an bit₂ boundary between groups bit₂₋₀ and bit₂₋₁, a bit₃ boundary between groups bit₃₋₀ and bit₃₋₁, and a bit₄ boundary between groups bit₄₋₀, and bit₄₋₁. For the 64-ary QAM symbol constellation space shown in FIG. 2B, only two groupings are shown, group bit₅₋₀ and group bit₅₋₁, for convenience, for the a₅ bit position. For each pair of groups of signal points that are associated with a bit position, there always exists one a bit boundary in the signal space that separate the pairs of bit_(i)-0 and bit_(i)-1 groups of signal points. The bit boundary bisecting of zero and one groups using straight-line bit_(i) bit boundaries is a result of the preferred gray scale mapping. Hence, the signal constellation space points are separated into bit_(i)-0 and bit_(i)-1 groups by i^(th) bit boundaries. The straight line bit_(i) bit boundaries can be designated by a y value or an x value in the constellation space for the preferred gray scale mapping. For examples, in the QAM signal space, the inphase horizontal i-axis where q=0 bisects the bit₁₋₀ and bit₁₋₁ groups, and quadrature vertical q-axis where i=0 bisects the bit₃₋₀ and bit₃₋₁ groups. All bit_(i-0) and bit_(i-1) groups for 16-ary QAM are shown in FIG. 2A, and only one such group for 64-ary QAM is shown in FIG. 2B.

To satisfy the probability equation and to generate soft metric equations, the smallest magnitude in symbol constellation space, that is, the minimum distance δ, from any signal point to the inphase i-axis or quadrature q-axis in either I or Q channels, respectively, among all symbol points, is used. The minimum distance δ is 1/√10 for 16-ary QAM. The minimum distance δ is 1/√42 for 64-ary QAM. The minimum distance δ can be used to define a point position or a bit boundary in the constellation space. For example, the i and q position values of symbol point {0,1,1,0} is at i=3δ and q=δ, and there is a bit₄ boundary line at i=±2δ. That is, the gray scale mapping enables the division of the symbol constellation space by bit boundaries for respective bits a_(i), for separating the constellation space into two groups of points having 0 or 1 bit values for the respective bit a_(i), in the respective bit position, so that, for each bit a_(i), the constellation space is separated into a group of 0 bit values and a group of 1 bit values. That is, the bit boundaries separate 0 and 1 bit value groups of points. Using the gray scale mapping, the bit boundary lines extend in parallel to either the i-axis at a q-axis at values being multiples of the minimum distance δ. As such, the bit boundary always extends between adjacent point pairs of 0 and 1 values for the respective bit position. The received signals are the received points in terms of x-i and y-q constellation space values, and, the bitwise soft metric Λ is computed as the minimum spatial distance from the receive point to a bit boundary that separates zero and one bit values for the respective bit position. The bitwise soft metrics Λ is computed using soft metric equations, one for each bit position. As such, and significantly, the soft metric Λ is only a function of the demodulated received signal value r_(k) and the minimum distance δ in the constellation space.

In the case of 16-ary QAM, for example as shown in FIG. 2A, bit₁₋₀ and bit₁₋₁ groups of points have a bit₁ boundary line that extends along the inphase i-axis at q=0. That is, the bit₁, boundary, which extends between the 0 and 1 values of the first bit a₁, extends along the inphase i-axis. Hence, the distance from the received signal to the bit₁ boundary line for the first bit a₁ is the distance from the received signal in quadrature r^((q)) to the inphase i-axis, and hence, the soft metric is Λ_(k)(1)=−r^((q)) _(k), that is, the negative value of the received signal in quadrature. All of the 1 values for bit a₁ are below the i-axis, and hence, the receive value in quadrature is negative. The negative sign in the soft metric Λ_(k)(1)=−r^((q)) _(k) changes the sign of the received signal so that all 1 values have a positive value. Oppositely, all positive received values of r^((q)) are above the i-axis, and the negative sign in the soft metric Λ_(k)(1)=−r^((q)) _(k) would provide a negative value, and hence, the sign of the soft metric Λ_(k)(1)=−r^((q)) _(k) computed value would indicate a 0 or 1 bit value, whereas the absolute value of the soft metric provides an indication of the probability of being a 0 or 1 bit value. As such, the Euclidean distances of the received signal perpendicular to the boundary lines represent reliability information for the corresponding received bit value especially in the presence of a high SNR. Therefore, with proper signs, the computed distances to a bit boundary can be used as the decoding soft metric and is efficiently computed.

In the case of the second bit a₂, as another example, the bit₂ boundary extends horizontally at q=±2δ, that is, between the top two rows and between the bottom two rows, where the second bit value changes between 0 and 1. The soft metric distance from a received point to the bit boundary is 2δ minus the received value in quadrature r^((q)), that is, the a₂ soft metric is Λ_(k)(2)=2/√10−|r^((q)) _(k)|, where δ=1/√10. In the case of the third bit a₃, the bit₃ boundary extends vertically along the quadrature q-axis at i=0. For the third bit a₃, the soft metric is the distance from the inphase received point r^((i)) to the quadrature q-axis that is the bit₃ boundary. The soft metric for bit a₃ is Λ_(k)(3)=r^((i)) _(k). The bit₄ boundaries extend vertically at x=±2δ, that is, between the first and second columns and between the third and fourth columns. For the fourth bit a₄, the soft metric inphase distance is Λ_(k)(4) =2δ−r^((i)) _(k)|, that is, Λ_(k)(⁴)=2/√10−|r^((i)) _(k)|. Hence, for 16-ary QAM, the soft metrics are computed as Λ_(k)(1)=−r^((q)) _(k), Λ_(k)(2)=2/√10−|r^((q)) _(k)|, Λ_(k)(3)=r^((i)) _(k), and, Λ_(k)(4)=2/√10 −|r^((i)) _(k)|.

The simplicity of these soft bit metric equations extends from the preferred gray scale mapping defining bit boundaries and from the computation of the distance from the received point in quadrature to the i-axis or the received point inphase to the q-axis. Using gray scale mapping, the vertical bit boundaries are intersected by the inphase i-axis and horizontal bit boundaries are intersected by the quadrature q-axis, that then enables derivation of the soft metric equations based only on the minimum distance δ and the inphase or quadrature received signal value in the constellation space. The minimum distance of the constellation space and the inphase or quadrature value of the received signal are all that is needed to compute the soft metric. These soft bit metrics computations do not require complicated CSI computations nor approximations, and can be readily implemented in the soft metric generator.

In the case of 64-ary QAM having a signal space as shown in FIG. 2B, the process of computing the soft metric remains the same in generating simple soft metric equations. The minimum distance δ and the inphase or quadrature value of the received signal are again applied to simple computation soft metric equations where the sign of the result indicates a zero or one value and the magnitude is the reliability indicator. The minimal spatial distance to the first point is δ. For example, the point 010110 has a coordinate location of i=δ and q=δ. The minimum absolute spatial distance from this point to either the i-axis or q-axis is δ. Again, for each bit position a_(i), there is a bit_(i) boundary separating groups of 0 and 1 bit values. For example, the bit₅ boundaries extends between the second and third columns and between the sixth and seventh columns, separating the signal constellation space into two groups bit₅₋₀ and bit₅₋₁, as conveniently shown in FIG. 2B. The bit₅ boundary is i±4δ. All bit_(i) boundaries can be specified in terms of i-axis and q-axis location as a function of the minimum distance δ. For 64-ary QAM, the gray scale constellation space also indicates that the inphase i-axis bisects vertical boundaries and that the quadrature q-axis bisects horizontal boundaries. The inphase or quadrature value of the received signal and minimum distance δ is all that is needed for computing the soft metric using the soft metric equations.

For 64-ary QAM, the bit, boundary is between a₁ bit position for bit₁₋₀ group and bit₁₋₁ group, and extends along the i-axis at q=±0δ=0. The bit₂ boundary line is between the a₂ bit position for 0 and 1 bit values, and extends horizontally at q=±4δ. The bit₃ boundary is between the a₃ bit position for 0 and 1 bit values, and extends horizontally at q=±2δ and q=+6δ. The bit₄ boundary is between the a₄ points whose a₄ bit positions have 0 and 1 values, and extends vertically at i=±0δ=0. The bit₅ boundary is between the a₅ points whose a₅ bit positions have 0 and 1 values, and extends vertically at x=±4δ. The bit₆ boundary is between the a₆ points whose a₆ bit positions have 0 and 1 values, and extends vertically at x=±2δ and x=±6δ. Hence, for 64-ary QAM, Λ_(k)(1)=−r^((q)) _(k), Λ_(k)(2)=√42−|r^((q)) _(k)|, Λ_(k)(3)=2√42−|(|r^((q)) _(k)−4√42)|, Λ_(k)(4)=r^((i)) _(k), Λ_(k)(5)=4√42−|r^((i)) _(k)|, and, Λ_(k)(6)=2√42−|(|r^((i)) _(k)|−4√42)|. Using the preferred gray scale mapping applied to QAM, the vertical bit boundaries are intersected by the inphase i-axis and horizontal bit boundaries are intersected by the quadrature q-axis, that then enables derivation of the soft metric equations based only on the minimum distance δ and the demodulated received signal value r_(k) for ease of computation of the soft metric having a metric sign indicating a zero or one bit value and having a metric magnitude indicating the probability of being a zero or one bit, respectively.

FIG. 4 shows the BER performances for 16-ary QAM and 64-ary QAM using the new bit boundary third method as compared to the prior art first method, and as compared to prior art BPSK modulation. The maximum likelihood metric using the first method is the optimum for the uncoded case but does not provide the optimum performance in the coded case. Metric computation using the prior art second method gives a very similar performance to the prior art first method, while the new third bit boundary method always provides superior performance. The advantage of using new third bit boundary method over the first and second methods is 0.25 dB for 16-ary QAM or 0.75 B for 64-ary QAM at a BER of 10⁻⁶. As compared to the uncoded case, the respective coding gains using the third bit boundary method are 10.5 dB for 16-ary QAM and 12.0 dB for 64-ary QAM at a BER of 10⁻⁶. The advantage of using turbo code over a rate 1/2, constraint length 7 convolutional code is 3.0 dB for 16-ary QAM or 3.3 dB for 64-ary QAM. The functions of exponentiation, summation, and logarithm used for computing the soft metric using the first method, as well as the maximization used for computing in the second method, are complicated operations for hardware implementation. The forming of soft metrics from the first and second methods also requires the knowledge of CSI. An inaccurate value of CSI will result in an incorrect soft metric and in turn will cause additional performance degradation. Hence, the new third bit boundary method based on bit boundaries is preferred, and only requires simple computational operations, does not require CSI computation, and presents a computational advantage over the first and second methods.

The new third bit boundary method can also be applied when using PSK modulation. For PSK signal constellation using the PSK symbol constellation, for examples and as shown in FIGS. 3A and 3B, and for any demodulated received signal [r^((i))k, r^((q))k], the symbol that was most likely transmitted is the one with the smallest angular separation or the greatest cosinusoidal value of the angular separation. Therefore, the soft metric considered can be formed using soft metric polar equation that does not require CSI information.

${\Lambda_{k}(n)} = {{\underset{{j = 1};{a_{n} = 1}}{\overset{M}{MAX}}\left( {{r_{k}^{(i)} \cdot {x(j)}} + {r_{k}^{(q)} \cdot {y(j)}}} \right)} - {\underset{{j = 1};{a_{n} = 0}}{\overset{M}{MAX}}\left( {{r_{k}^{(i)} \cdot {x(j)}} + {r_{k}^{(q)} \cdot {y(j)}}} \right)}}$

From the signal constellation space shown in FIGS. 3A and 3B, all received symbol points have unity intensity and are equiangularly and circumferentially disposed about the center 0,0 location of the symbol constellation space, as shown. By way of example, for 8-ary PSK there are eight points, and for 16-ary PSK there are sixteen points, as shown. The angular boundary lines are shown in polar form as radiating from the center location and having a bit boundary angle β that uniquely defines the angular boundary line. As such, all bit boundary lines extend from the center location at a respective angle β, Similar to using QAM, the angular boundary lines separate a_(i) bits into bit_(i-0) and bit_(i-1) groups of bits of zeros and ones. The boundary line angle β is a function of a minimum angle α where α=2π/M and is the minimum angular separation between two adjacent signals on the signal constellation space. In the case of 8-ary PSK, where M=8, the minimum angle α is 2π/8 or α=π/4=45°. In the case of 16-ary PSK, the minimum angle α=2π/16 or α=π/8=22.5° degrees. The shortest Euclidean distance from a received signal point in the symbol constellation space to an angular boundary line again represents the soft metrics as reliability information for the corresponding bit especially in the high SNR case. With proper signs, the shortest distances can be efficiently computed as bitwise soft metrics. The shortest distance extends along a line that is perpendicular to the angular boundary line and extends between the received signal point to the closest angular boundary line.

For 8-ary PSK, the minimum angle α is π/4. The bit₁ boundary lines for bit a₁ are β=±2α=±π/2 for separating the bit₁₋₀ group of zero bit values for the bit a₁ and the bit₁₋₁ group of one bit values for the bit a₁. The bit₂ boundary lines are at β=2α±2α=(π/2)±(π/2)=π;0, for separating the bit₂₋₀ group of zero bit values for the bit a₂ and the bit₂₋₁ group of one bit values for the bit a₂. The bit₃ boundary lines are at β=±α=±π/4 and β=±3α=±3π/4 for separating the bit₃₋₀ group of zero bit values for the bit a₃ and the bit₃₋₁ group of one bit values for the bit a₃.

A soft metric is the shortest distance from the received signal to the bit_(i) boundary lines associated with a respective bit a_(i). There are respective distances from the received point to respective boundary lines. The shortest distance to the closet boundary line is the distance used, that is, the soft metric. For generating closed form bitwise soft metric equations, the received point defines a phase angle γ where γ=tan⁻¹(r^((q)) _(k)/r^((i)) _(k)). The phase angle γ is the phase angle of the received signal (r^((i)) _(k), r^((q)) _(k)), that is, the polar angle of the received signal in the symbol constellation space. The phase angle γ can be used to efficiently compute the soft metric as shown in an 8-ary PSK soft metrics computation table.

8-ary PSK Soft Metrics Computation Table Λ_(k) (1) = +[r^((q)) _(k)cos(2α) − r^((i)) _(k)sin(2α)] = −r^((i))k Λ_(k) (2) = − [r^((q)) _(k)cos(0) − r^((i)) _(k)sin(0)] = −r^((q))k Λ_(k)(3) = + [r^((q)) _(k)cos(α) − r^((i)) _(k)sin(α)] if α − α ≦ γ < α + α or −[r^((q)) _(k)cos(3α) − r^((i)) _(k)sin(3α)] if 3α − α ≦ γ < 3α + α or +[r^((q)) _(k)cos(5α) − r^((i)) _(k)sin(5α)] if 5α − α ≦ γ < 5α + α or −[r^((q)) _(k)cos(7α) − r^((i)) _(k)sin(7α)] if 7α − α ≦ γ < 7α + α Λ_(k)(3) = +[r^((q)) _(k)cos(π/4) − r^((i)) _(k)sin(π/4)] if 0 ≦ γ < π/2 or −[r^((q)) _(k)cos(3π/4) − r^((i)) _(k)sin(3π/4)] if π/2 ≦ γ < π or +[r^((q)) _(k)cos(5π/4) − r^((i)) _(k)sin(5π/4)] if π ≦ γ < 3π/2 or −[r^((q)) _(k)cos(7π/4) − r^((i)) _(k)sin(7π/4)] if 3π/2 ≦ γ < 2π

For 16-ary PSK, the minimum angle α is π/8. The bit₁ boundary lines for bit a₁ are β=±4α=π/2 for separating the bit₁₋₀ group of zero bit values for the bit a₁ and the bit₁₋₁ group of one bit values for the bit a₁. The bit₂ boundary lines are at β=4α±4α=(π/2)±(π/2), for separating the bit₂₋₀ group of zero bit values for the bit a₂ and the bit₂₋₁ group of one bit values for the bit a₂. The bit₃ boundary lines are at β=±2α=±π/4 and β=+6α=±3π/4 for separating the bit₃₋₀ group of zero bit values for the bit a₃ and the bit₃₋₁ group of one bit values for the bit a₃. The bit₄ boundary lines are at β=±α=π/8, β=4α±α=(π/2)±(π/8), β=8α±α=π±π/8, and β=12α±α=(3π/2)±(π/8) for separating the bit₄₋₀ group of zero bit values for the bit a₄ and the bit₄₋₁ group of one bit values for the bit a₄. The soft metrics computations for 16-ary PSK are listed in a 16-ary PSK soft metrics computation table.

16-ary PSK Soft Metrics Computation Table Λ_(k)(1) = +[r^((q)) _(k)cos(4α) − r^((i)) _(k)sin(4α)] = −r^((i)) _(k) Λ_(k)(2) = −[r^((q)) _(k)cos(0) − r^((i)) _(k)sin(0)] = −r^((q)) _(k) Λ_(k)(3) = +[r^((q)) _(k)cos(2α) − r^((i)) _(k)sin(2α)] if 2α − 2α ≦ γ < 2α + 2α or −[r^((q)) _(k)cos(6α) − r^((i)) _(k)sin(6α)] if 6α − 2α ≦ γ < 6α + 2α or +[r^((q)) _(k)cos(10α) − r^((i)) _(k)sin(10α)] if 10α − 2α ≦ γ < 10α + 2α or −[r^((q)) _(k)cos(14α) − r^((i)) _(k)sin(14α)] if 14α − 2α ≦ γ < 14α + 2α Λ_(k)(3) = +[r^((q)) _(k)cos(π/4) − r^((i)) _(k)sin(π/4)] if 0 ≦ γ < π/2 or −[r^((q)) _(k)cos(3π/4) − r^((i)) _(k)sin(3π/4)] if π/2 ≦ γ < π or +[r^((q)) _(k)cos(5π/4) − r^((i)) _(k)sin(5π/4)] if π ≦ γ < 3π/2 or −[r^((q)) _(k)cos(7π/4) − r^((i)) _(k)sin(7π/4)] if 3π/2 ≦ γ < 2π Λ_(k)(4) = +[r^((q)) _(k)cos(α) − r^((i)) _(k)sin(α)] if α − α ≦ γ < α + α or −[r^((q)) _(k)cos(3α) − r^((i)) _(k)sin(3α)] if 3α − α ≦ γ < 3α + α or +[r^((q)) _(k)cos(5α) − r^((i)) _(k)sin(5α)] if 5α − α ≦ γ < 5α + α or −[r^((q)) _(k)cos(7α) − r^((i)) _(k)sin(7α)] if 7α − α ≦ γ < 7α + α or +[r^((q)) _(k)cos(9α) − r^((i)) _(k)sin(9α)] if 9α − α ≦ γ < 9α + α or −[r^((q)) _(k)cos(11α) − r^((i)) _(k)sin(11α)] if 11α − α ≦ γ < 11α + α or +[r^((q)) _(k)cos(13α) − r^((i)) _(k)sin(13α)] if 13α − α ≦ γ < 13α + α or −[r^((q)) _(k)cos(15α) − r^((i)) _(k)sin(15α)] if 15α − α ≦ γ < 15α + α Λ_(k)(4) = +[r^((q)) _(k)cos(π/8) − r^((i)) _(k)sin(π/8)] if 0 ≦ γ < π/4 or −[r^((q)) _(k)cos(3π/8) − r^((i)) _(k)sin(3π/8)] if π/4 ≦ γ < π/2 or +[r^((q)) _(k)cos(5π/8) − r^((i)) _(k)sin(5π/8)] if π/2 ≦ γ < 3π/4 or −[r^((q)) _(k)cos(7π/8) − r^((i)) _(k)sin(7π/8)] if 3π/4 ≦ γ < π or +[r^((q)) _(k)cos(9π/8) − r^((i)) _(k)sin(9π/8)] if π ≦ γ < 5π/4 or −[r^((q)) _(k)cos(11π/8) − r^((i)) _(k)sin(11π/8)] if 5π/4 ≦ γ < 3π/2 or +[r^((q)) _(k)cos(13π/8) − r^((i)) _(k)sin(13π/8)] if 3π/2 ≦ γ < 7π/4 or −[r^((q)) _(k)cos(15π/8) − r^((i)) _(k)sin(15π/8)] if 7π/4 ≦ γ < 2π

As may be apparent, the soft metrics are computed based only on the received signal and minimum angle α using a closed form equation for efficient computation of the soft metrics.

The computation of the soft metrics for M-ary PSK can be generalized. For M-ary PSK, where M=2^(L) and α=2π/M, a general form of the soft metrics equations are listed in a M-ary PSK soft metrics computation table.

M-ary PSK Soft Metrics Computation Table Λ_(k)(1) = +[r^((q)) _(k)cos(Mα/4) − r^((i)) _(k)sin(Mα/4] = −r^((i)) _(k) Λ_(k)(2) = −[r^((q)) _(k)cos(0) − r^((i)) _(k)sin(0)] = −r^((q)) _(k) Λ_(k)(L) = +[r^((q)) _(k)cos(α) − r^((i)) _(k)sin(α)] if α − α ≦ γ < α + α or −[r^((q)) _(k)cos(3α) − r^((i)) _(k)sin(3α)] if 3α − α ≦ γ < 3α + α or +[r^((q)) _(k)cos(5α) − r^((i)) _(k)sin(5α)] if 5α − α ≦ γ < 5α + α . . . or + [r^((q)) _(k)cos((M − 3)α) − r^((i)) _(k)sin((M − 3)α)] if (M − 3)α − α ≦ γ < 2(M − 3)α + α or −[r^((q)) _(k)cos((M − 1)α) − r^((i)) _(k)sin((M − 1)α)] if (M − 1)α − α ≦ γ < 2(M − 1)α + α Λ_(k)(L − 1) = +[r^((q)) _(k)cos(2α) − r^((i)) _(k)sin(2α)] if 2α − 2α ≦ γ < 2α + 2α or −[r^((q)) _(k)cos(6α) − r^((i)) _(k)sin(6α)] if 6α − 2α ≦ γ < 6α + 2α or +[r^((q)) _(k)cos(10α) − r^((i)) _(k)sin(10α)] if 10α − 2α ≦ γ < 10α + 2α . . . or +[r^((q)) _(k)cos(2(M − 3)α) − r^((i)) _(k)sin(2(M − 3)α)] if 2(M − 3)α − 2α ≦ γ < 2(M − 3)α + 2α or −[r^((q)) _(k)cos(2(M − 1)α) − r^((i)) _(k)sin(2(M − 1)α)] if 2(M − 1)α − 2α ≦ γ < 2(M − 1)α + 2α Λ_(k)(L − t)_((for t<L−2)) = +[r^((q)) _(k)cos(2^(t)α) − r^((i)) _(k)sin(2^(t)α)] if 2^(t)α − 2^(t)α ≦ γ < 2^(t)α + 2^(t)α or −[r^((q)) _(k)cos(2^(t)3α) − r^((i)) _(k)sin(2^(t)3α)] if 2^(t)3α − 2^(t)α ≦ γ < 2^(t)3α + 2^(t)α or +[r^((q)) _(k)cos(2^(t)5α) − r^((i)) _(k)sin(2^(t)5α)] if 2^(t)5α − 2^(t)α ≦ γ < 2^(t)5α + 2^(t)α . . . or +[r^((q)) _(k)cos(2^(t)(M − 3)α) − r^((i)) _(k)sin(2^(t)(M − 3)α)] if 2^(t)(M − 3)α − 2^(t)α ≦ γ < 2^(t)(M − 3)α + 2^(t)α or −[r^((q)) _(k)cos(2^(t)(M − 1)α) − r^((i)) _(k)sin(2^(t)(M − 1)α)] if 2^(t)(M − 1)α − 2^(t)α ≦ γ < 2^(t)(M − 1)α + 2^(t)α

FIG. 5 shows the BER performance for 8-ary PSK and 16-ary PSK for the new bit boundary third method as compared to the prior art first method and prior art BPSK modulation. The BER performances in additive white Gaussian noise channel results from the decoding metrics for 8-ary PSK and 16-ary PSK. Ten iterations are used during turbo decoding prior to making hard decisions about the information sequence. To ensure an accurate estimation of BER values, a minimum of 500 bit errors are accumulated at each operating point of the simulation. The simulations indicate that the maximum likelihood metric, which is the optimum for the prior art uncoded case, provides the worst BER performance among three methods discussed. The prior art first and second methods essentially provide a fixed improvement of 0.5 dB for 8-ary PSK and 1.25 dB for 16-ary PSK in an average white Gaussian noise channel over the entire operating region of Eb/N0. The new third bit boundary method always provides the best performance in an average white Gaussian noise channel. The new third bit boundary method also shows improved performance in fading channels. The advantage of using the new third method over the first and second methods is 1.0 dB for 8-ary PSK or 1.5 dB for 16-ary PSK in the average Gaussian noise channel case at a BER of 10⁻6. This advantage is reduced to around 0.7 dB in the fading case for both 8-ary PSK and 16-ary PSK. As compared to the uncoded case, the respective coding gains using the new third bit boundary method are 10.5 dB for 8-ary PSK and 12.5 dB for 16-ary PSK at a BER of 10⁻⁶ for an average white Gaussian noise channel.

The metrics generator is used for computing soft metrics, but in the case of the prior art first and second methods, the operations are complicated, time-consuming, and inefficient. The preferred third bit boundary method requires only the received signal and minimum angle α. Additionally, the first and second methods also require knowledge of CSI. An inaccurate value of CSI will result in an incorrect soft metric that will in turn cause additional performance degradation. This requirement of accurate CSI imposes a disadvantage not found in the third bit boundary method. Hence, the adoption of third bit boundary method does not require CSI knowledge and presents computational advantages. The spectral efficiencies can be achieved for symbol waveforms of 1.5 bits/symbol when 8-ary PSK is used, and, 2.0 bits/symbol when 15-ary PSK is used. A degradation of 1.0 dB occurs when using rate 2/3 as opposed to rate 1/2 turbo code. Applying this 1.0 dB degradation when rate 2/3 turbo code is used, the required E_(b)/N₀ is 4.3 dB for 8-ary PSK at 2.0 bits/symbol, or 6.5 dB for 16-ary PSK at 3.0 bits/symbol, respectively, in order to achieve a BER of 10⁻⁶.

The present invention is directed to bit boundary computation methods of computing turbo decoding soft metrics at the output of the QAM or PSK demodulator. The preferred third bit boundary method only requires the simple computation from the receive signal values and performs with improved BER. The turbo-coded gray scale mapped and modulated waveforms provide similar performances to turbo trellis coded modulation based on the same interleaver size, and the same bandwidth efficiency, and the number of information bits per channel symbol. While the preferred form is directed to normalized minimum distances δ and angles α, and directed to gray scale mapping, the invention is generally applicable to any signal constellation space, applicable to any M-ary QAM or PSK modulation, applicable to any arbitrary turbo code, applicable to any type of mapping, to any arbitrary boundary lines, provided that the boundary lines separate groups of zero and one bit values for bitwise metric computation based on the computed shortest distance from the received point to a boundary line that extends in whole or in part through the signal constellation space. The new third method does not require new development of a new turbo codec. Although some turbo trellis code modulation schemes use a code structure of eight states, which is less complicated than the one used in the new third method, it is well known that the commonly used turbo codes with 8 states and 16 states perform essentially the same at a BER above 10⁻⁶. Therefore, a new third bit boundary method turbo code system provides a viable alternative to a turbo trellis coded modulation system. Those skilled in the art can make enhancements, improvements, and modifications to the invention, and these enhancements, improvements, and modifications may nonetheless fall within the spirit and scope of the following claims. 

1. A system for communicating channel symbols, the system comprising, a turbo encoder for turbo encoding input data into turbo encoded data, a mapper for mapping the turbo encoded data into mapped data defining symbols of a_(i) bits, the mapping serving to define boundary lines within a symbol constellation space of the symbols, the constellation signal space is a quadrature signal constellation space having a horizontal inphase i-axis and a vertical quadrature q-axis, the boundary lines extending through the symbol constellation space for bitwise separating zero and one bit values into respective bit_(i-0) and bit_(i-1) groups, a modulator for modulating the mapped data into channel symbols within the symbol constellation space, the modulator serving to communicate the channel symbols across a communication channel, a demodulator for M-ary demodulating each of the channel symbols into respective received signals where M=2^(L) where L is a number of bits in the channel symbols, the received signals have an inphase component r^((i)) and a quadrature component r^((q)), a soft metrics generator for generating bitwise soft metrics Λ(i) for each bit a_(i) from each of the received signals, each of the bitwise soft metrics being a shortest distance from the received signal to one of the bitwise bit_(i) boundary lines, and a turbo decoder for decoding the bitwise soft metrics into an estimate of the input data, the modulator is a phase shift keying (PSK) modulator.
 2. The system of claim 1 wherein, the modulator is a phase shift keying (PSK) modulator, M=8 for 8-ary PSK communications.
 3. The system of claim 1 wherein, the modulator is a phase shift keying (PSK) modulator, and M is equal to 16 for 16-ary PSK communications.
 4. A system for communicating channel symbols, the system comprising, a turbo encoder for turbo encoding input data into turbo encoded data, a gray scale mapper for gray scale mapping the turbo encoded data into gray scale mapped data defining gray scale symbols of a_(i) bits, the gray scale mapping serving to define boundary lines within a symbol constellation space of the gray scale symbols, the constellation signal space is a quadrature signal constellation space having a horizontal inphase i-axis and a vertical quadrature q-axis, the constellation signal space defining a minimum angle α, the boundary lines being defined by respective angles β that are a function of the minimum angle α, the boundary lines radially extending from a center point by the angle β of the symbol constellation space for bitwise separating zero and one bit values into respective bit_(i-0) and bit_(i-1) groups, a modulator for modulating the gray scale mapped data into channel symbols within the symbol constellation space, the modulator serving to communicate the channel symbols across a communication channel, a demodulator for M-ary demodulating each of the channel symbols into respective received signals where M=2^(L) where L is a number of bits in the channel symbols, the received signals have an inphase component r^((i)) and a quadrature component r^((q)), a soft metrics generator for generating bitwise soft metrics Λ(i) for each bit a_(i) from each of the received signals, each of the bitwise soft metrics being a shortest distance from the received signal to one of the bitwise bit_(i) boundary lines, and a turbo decoder for decoding the bitwise soft metrics into an estimate of the input data, the modulator is a phase shift keying (PSK) modulator.
 5. The system of claim 4 wherein, the modulator is a phase shift keying (PSK) modulator, M is the constellation index for M-ary PSK modulation, and the minimum angle α is 2π/M.
 6. The system of claim 4 wherein, the modulator is a phase shift keying (PSK) modulator, and M=8 for 8-ary PSK communications.
 7. The system of claim 4 wherein, the modulator is a phase shift keying (PSK) modulator, M=8 for 8-ary PSK communications, and the minimum angle α is π/4.
 8. The system of claim 4 wherein, the modulator is a phase shift keying (PSK) modulator, M=8 for 8-ary PSK communications, and the minimum angle a is π/4, the bit₁ boundary lines for bit a₁ are β=±2α for separating the bit₁₋₀ group of zero bit values for the bit a₁ and the bit₁₋₁ group one bit values for the bit a₁, the bit₂ boundary lines are at β=2α±2α for separating the bit₂₋₀ group of zero bit values for the bit a₂ and the bit₂₋₁ group one bit values for the bit a₂, and the bit₃ boundary lines are at β=±α and β=±3α for separating the bit₃₋₀ group of zero bit values for the bit a₃ and the bit₃₋₁ group one bit values for the bit a₃.
 9. The system of claim 4 wherein, the modulator is a phase shift keying (PSK) modulator, M is equal 8 for 8-ary PSK communications, the minimum angle α is π/4, and the soft metrics Λ(1)=+[r^((q)) cos(2α)−r^((i)) sin(2α)]=−r^((i)), the soft metrics Λ(2)=−[r^((q)) cos(0)−r^((i)) sin(0)]=−r^((q)), the soft metrics Λ(3)=+[r^((q)) cos(π/4)−r^((i)) sin(π/4)] when 0≦γ<π/2, Λ(3)=−[r^((q)) cos(3π/4)−r^((i)) sin(3π/4)] when π/2≦γ<π, +[r^((q)) cos(5π/4)−r^((i)) sin(5π/4)] when π≦γ<3π/2, and Λ(3)=−[r^((q)) cos(7π/4)−r^((i)) sin(7π/4)] when 3π/2≦γ<2π where γ=tan⁻¹ (r^((q))/r^((i))).
 10. The system of claim 4 wherein, the modulator is a phase shift keying (PSK) modulator, and M is equal to 16 for 16-ary PSK communications.
 11. The system of claim 4 wherein, the modulator is a phase shift keying (PSK) modulator, M is equal to 16 for 16-ary PSK communications, and the minimum angle α is π/8.
 12. The system of claim 4 wherein, the modulator is a phase shift keying (PSK) modulator, M is equal to 16 for 16-ary PSK communications, the minimum angle α is π/8, the bit₁ boundary lines for bit a₁ is at β=±4α for separating the bit₁₋₀ group of zero bit values for the bit a₁ and the bit₁₋₁ group one bit values for the bit a₁, the bit₂ boundary lines are at β=4α±4α for separating the bit₂₋₀ group of zero bit values for the bit a₂ and the bit₂₋₁ group one bit values for the bit a₂, the bit₃ boundary lines are at β=±2α and β=±6α for separating the bit₃₋₀ group of zero bit values for the bit a₃ and the bit₃₋₁ group one bit values for the bit a₃, and the bit₄ boundary lines are at β=±α, β=4α±α, β=8α±α, and β=12α±α for separating the bit₄₋₀ group of zero bit values for the bit a₄ and the bit₄₋₁ group one bit values for the bit a₄.
 13. The system of claim 4 wherein, the modulator is a phase shift keying (PSK) modulator, M is equal to 16 for 16-ary PSK communications, the minimum angle α is π/8, the soft metric Λ(1)=+[r^((q)) cos(4α)−r^((i)) sin(4α)]=−r^((i)), the soft metric Λ(2)=−[r^((q)) cos(0)−r^((i)) sin(0)]=−r^((q)), the soft metric Λ(3)=+[r^((q)) cos(π/4)−r^((i)) sin(π/4)] when 0≦γ<π/2, Λ(3)=−[r^((q)) cos(3π/4)−r^((i)) sin(3π/4)] when π/2≦γ<π, Λ(3)=+[r^((q)) cos(5π/4)−r^((i)) sin(5π/4)] when π≦γ<3π/2, and Λ(3)=−[r^((q)) cos(7π/4)−r^((i)) _(k) sin(7π/4)] when 3π/2≦γ<2π, and the soft metric Λ(4)=+[r^((q)) cos(π/8)−r^((i)) sin(π/8)] when 0≦γ<π/4, Λ(4)=−[r^((q)) cos(3π/8)−r^((i)) sin(3π/8)] when π/4≦γ<π/2, Λ(4)=+[r^((q)) cos(5π/8)−r^((i)) sin(5π/8)] when π/2≦γ<3π/4, Λ(4)=−[r^((q)) _(k) cos(7π/8)−r^((i)) sin(7π/8)] when 3π/4≦γ<π, Λ(4)=+[r^((q)) cos(9π/8)−r^((i)) sin(9π/8)] when π≦γ<5π/4, Λ(4)=−[r^((q)) cos(11π/8)−r^((i)) sin(11π/8)] when 5π/4≦γ<3π/2, Λ(4)=+[r^((q)) _(k) cos(13π/8)−r^((i)) sin(13π/8)] when 3π/2≦γ<7π/4, and Λ(4)=−[r^((q)) cos(15π/8)−r^((i)) sin(15π/8)] when 7π/4≦γ<2π where γ=tan⁻¹ (r^((q))/r^((i))). 